Packet loss prevention during handoff through managed buffer nodes architecture

ABSTRACT

In preferred embodiments, a wireless network system features buffering of data packets transmitted to mobile nodes. The system is transparent to the mobile node, so that the mobile node is not required to request service from the network, or negotiate service parameters with the network. An EAPOL-Start and binding update messages initiate and terminate the buffering, and also commence pre-authentication and smooth handoff reporting, respectively.

The present application claims priority to U.S. Provisional ApplicationSer. No. 60/596,660, entitled Packet Loss Prevention During HandoffThrough Managed Buffer Nodes Architecture filed on Oct. 11, 2005, theentire disclosure of which is incorporated herein by reference. Thepresent application also relates to: [1] U.S. Provisional ApplicationSer. No. 60/596,659, filed on Oct. 11, 2005; [2] U.S. patent applicationSer. No. 11/308,175, filed on Mar. 9, 2006 entitled Framework of MediaIndependent Pre-Authentication; [3] U.S. patent application Ser. No.09/872,213, filed on Jun. 1, 2001, the entire disclosures of each ofwhich applications [1] to [3] are incorporated herein by reference. Theentire disclosures of the following IETF documents are also incorporatedherein by reference in their entireties (see: www.Ietf.org): [1]draft-krishnamurthi-mobileip-buffer6-00.txt; [2]draft-ietf-mipshop-fast-mipv6-03.txt; [3].draft-mkhalil-mobileip-buffer-00.txt; [4]draft-moore-mobopts-tunnel-buffering-00.txt.

BACKGROUND

1. Field of the Invention

The present invention relates generally to wireless networking, and, insome preferred embodiments to the prevention of lost packets due tonetwork layer and link layer transition.

2. General Background Discussion

A mobile network seeks to provide security, smooth handoff, minimal dataloss and minimal delay. Many of the existing networks involvecommunication between a Mobile Node (MN) and a Buffering Node (BN).Buffering Service in these cases is inefficient as it requires the MN toexplicitly solicit the service. As a result, the amount of wirelesssignaling traffic is great, and the MN's energy usage is also great,reducing the amount of energy available for sending and receivingmessages until a consensus is reached.

Some of the drawbacks of the existing networks are detailed below.

One drawback pertains to an extension to the lUv6 Router, which callsfor a router to advertise its ability to support buffering, and whichrequires the MN to beg the Buffering Node for its desired buffer size,requiring a high volume of messages. This high volume of messagespertaining to BN discovery, as well as probes and responses concerningthe service and service negotiation not only consumes scarce networkresources, but also adds additional latency to the network.

Another drawback pertains to buffer size. Once a MN receives anadvertised indication that Buffering Services are available, the MN mayrequest a specific buffer size. Depending on available resources, the BNmay or may not accept this request. Likely, the BN is constrained by abuffer protocol, in which case, if the MN request exceeds the upperlimit, the BN may offer a smaller buffer size. Further, if the BN iscritically low in available resources, it will send messages back andforth to the MN in an attempt to find an agreeable buffer size,attempting to arrive at a compromise position. In spite of thisnegotiation, the end result of the requests may be a denial of service.This process leads one to conclude that the BN is in control, and thatthe MN has no option to protect the packets of data it is trying to sendto the BN. As the MN has no other alternative in the event the BN deniesservice, the MN does not establish communications with the BN or wasteits time and energy.

Another drawback occurs when the router cannot accept new requests forbuffering, due to resource shortages, but still continues to advertiseits capability of buffering and then replying negatively toinitialization requests. The router does not have the ability to stopadvertising when it is unable to provide buffering because this willadversely affect the handoff operation. This situation creates anunnecessary burden on the network and is illogical as well—advertisingservices while being unable to provide them.

Another drawback is concerned with the network awareness of the movementof the MN with regard to buffering control protocols in NetworkControlled Mobile Assisted (NCMA) handoff mode. In this situation, theprevious router supplies the new router with current state informationfor the MN before the handoff actually occurs and also directs thebuffered packets to the new router without the MN's intervention. The MNis thus not required to negotiate with the network and explicitlyrequest initialization of the buffering state and subsequent bufferedpacket forwarding. However, in many cases, the MN still has to negotiatebecause the protocols require the MN to do so. Therefore, even in a NCMAcase, the MN will always have to issue a Smooth Handoff Initialization(SHIN) to the new router, because it has received a router advertisementfor service.

Yet another drawback is directed towards the Buffering Control Protocolsrequiring the MN to send an anticipated buffer size and time durationfor buffer usage. Since Internet Protocol (IP) traffic is of a burstynature; that is, a continuous transfer of data without interruption fromone device to another, any MN estimation may not be accurate, whichresults in either over-or underestimating the pre-buffering size. Evenif an accurate estimation is made by the MN, the buffer size demanded bythe MN may not be immediately available, but may become available onlymoments later, when the BN has completed servicing other MN(s). Thisinstantaneous decision (to accept, deny, or compromise) is based solelyon the conditions present at that instant, without regard to conditionsin the near future.

Still another drawback is the occurrence of a “time-limited timeout”condition that affects the efficient performance of both the MN as wellas the BN since the BN automatically stops buffering without receivingany message (i.e., BReq[stop]) from the MN. In fact, the BReq[stop]message serves a double purpose. First, it stops the buffering event;and second, it informs the BN of the new CoA (Care of Address). In theevent of a time-limited timeout, the BN stops buffering withoutreceiving a BReq[stop] message and without receiving the flushingdestination (CoA). In order to overcome this situation, the MN must senda separate message “BReq[ext]” to inform the BN, the new CoA, andrequest an extension of buffering time. If this situation occursrepeatedly, the BN will have received multiple CoAs (though it will usethe last CoA for flushing the data packets). This entire situation isundesirable due to the required increased signaling burden and wastedmemory required to hold the redundant information of several CoAs. Also,since there is a requirement on the MN to send BReq[ext] messages beforethe end of the time-limited timeout period, the MN battery life isadversely affected.

In view of the foregoing, an improved buffering service is needed in thewireless network art, which includes a complete architecture harnessedto provide a comprehensive buffering service that offers packet lossprevention to packets in transit during handoffs. More particularly, theimproved buffering service of the present invention provides awell-managed buffering architecture harnessed to provide maximum buffersize that best meets the needs of MNs without solicitations ornegotiations; reserves buffer size based on multiple factors, includingMN's current application, network speed in which MN is roaming, and nearfuture demand and resource predictions; is completely autonomous so thatthe BNs perform their tasks by communicating amongst other peer BNs andnetwork entities without involving assistance from the MN; can beimplemented without introducing new protocols that would enable MNs tocommunicate with the network for this specific service.

SUMMARY OF THE PREFERRED EMBODIMENTS

The preferred embodiments of the present invention can significantlyimprove upon the prior art and provide a solution to the problem of animproved buffering service is needed in the wireless network art, whichincludes a complete architecture harnessed to provide a comprehensivebuffering service that offers packet loss prevention to packets intransit during handoffs.

According to one aspect of the present invention, a managed buffer nodesarchitecture is provided, including the following functional entities: aControlling Buffer Node (CBN); a Transition Buffer Node (TBN); and aFlushing Buffer Node (FBN). The controlling buffer node performsmanagerial functions; the transition buffer node holds data packets intransit; and the flushing buffer node facilitates the delivery of datapackets. Further, in this embodiment of the present invention, thesenodes communicate with each other internally (i.e., no directcommunication with external elements e.g., MN), and are less prone tosecurity incursions. The access point (AP) plays a controlling role witha special ability to communicate with APs.

According to one aspect of the present invention, a CBN is provided thatis a controlling authority and performs multiple functions: the CBN willbe capable of receiving a copy of a EAPOL-Start (ExtensibleAuthorization Protocol Over Lan) message from the AP where the MN iscurrently located, and extract information; be capable of retrieving,from its own database, the IP address of the TBN and direct the TBN tostart buffering; be capable of receiving a copy of a binding update fromMN through the previous router, to extract a new CoA of MN in a newnetwork; and be capable of collecting information from TBNs and FBNs formanagement purposes.

According to one embodiment of the present invention, the TBN will becapable of performing multiple functions, including: receiving a messagefrom the CBN indicating that the MN will handoff; allocating appropriateBuffer Lease Time (BLT), further determined by the user's application,currently available resources, and data rate; extending BLT if required;running compression algorithms to efficiently allocate memory capacity;receiving a second message from the CBN that the MN has completedhandoff; draining the buffer packets in the event the service is notdelivered successfully; storing the received packets according to theapplications; assisting CBN in performing management functions;informing the assisting CBN in performing management functions.

According to one embodiment of the present invention, the FlushingBuffer Node (FBN) will be capable of performing multiple functions,including: acting as a tunnel termination point—receiving packets fromthe TBN; decapsulating the packets and dispatching them to the APimmediately for further transmission to the MN; receiving packets frompeer buffering nodes.

According to another embodiment of the present invention, the CBN, afterreceiving the destination address of the AP, issues a “release buffer”trigger to the TBN to initiate tunneling packets to the specific FBN. IPaddresses to the CBN, TBN, and FBN can be either statically ordynamically assigned, as well as private and not visible outside thenetwork for additional security.

According to another embodiment of the present invention, an ARIMA(autoregressive integrated moving average) model is used to predict thebuffering resource demand and then apply the model to predict futurebuffering resource demand, whereby each CBN is able to accurately,precisely and efficiently predict and reserve a sufficient amount ofbuffering resources.

BRIEF DESCRIPTION OF THE DRAWINGS

The preferred embodiments of the present invention are shown by way ofexample, and not limitation, in the accompanying figures, in which:

FIG. 1 is a diagram of a managed buffer nodes architecture, inaccordance with an embodiment of the present invention;

FIG. 2(a) is a diagram of controller buffer node tasks, in accordancewith an embodiment of the present invention;

FIG. 2(b) is a table constructed by BNC as per tasks of FIG. 1(a), inaccordance with an embodiment of the present invention;

FIG. 3(a) is a diagram of transit buffer node tasks, in accordance withan embodiment of the present invention;

FIG. 3(b) is a chart of processor functions, in accordance with anembodiment of the present invention; and

FIG. 4 is a diagram of flushing buffering node (FBN) tasks, inaccordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

While the present invention may be embodied in many different forms, theillustrative embodiments are described herein with the understandingthat the present disclosure is to be considered as providing examples ofthe principles of the invention and that such examples are not intendedto limit the invention to preferred embodiments described herein and/orillustrated herein.

FIG. 1 illustrates an overview of a managed buffer nodes architectureaccording to an embodiment of the present invention. The architectureconsists of the following functional entities: Controlling Buffer Node(CBN); Transit Buffer Node (TBN); and Flushing Buffer Node (FBN). Eachentity, or node, as a specific task. For example, the CBN performsmanagerial functions, the TBN retains packets in transit; and the FBNfacilitates the delivery of packets. For improved security, these nodescommunicate with each other internally. This approach diminishes therisk from external security attacks, as no external elements are incommunication with the nodes. The Access Point (AP), which has acontrolling function, also has the special capability of communicatingwith other APs. The specific tasks of each node is detailed below.

The Controlling Buffer Node (CBN) primary task is as the controlauthority. As shown in FIG. 2, the CBN receives a copy of theEAPOL-Start message from the Access Point (AP) reporting on the MobileNode (MN) location (i.e. before moving to a new network). Afterreceiving this message, the CBN extracts the following information,which is saved in its own directory: source address of the AP (fromwhich the EAPOL-Start message is received); current address of the MN(assigned to the network where the MN is presently located); destinationaddress of the AP (for which the MN has requested pre-authentication andintends to move to).

The CBN receives and processes various information, including the IPaddress of the TBN serving the network where the MN is presentlylocated. The CBN will then instruct this TBN (associated with the MN) toinitiate buffering. The instruction will be issued to the TBN at thereceipt of the EAPOL-Start message from the MAC Layer Management Entity(MLME) of the access point in which the MN is located.

Further, the CBN receives a copy of the binding update from the MNthrough a previous router (or foreign agent in case of IPv4). Afterreceiving the binding update message, the CBN extracts a new address(also called a new CoA) of the MN in a new network, after the MN hasmoved to the new network.

The CBN also retrieves the IP address of the correct FBN from its owndatabase of FBNs duly mapped with address received in the bindingupdate, which binds, or registers, the MN's CoA with the MN's homeaddress.

In yet another function, the CBN collects information from TBNs and FBNsfor management functions. The CBN management is dictated by the policydesired; therefore, the user may direct the CBN to collect informationin about a variety of information, including available capacity, usedcapacity, and predicted demand, from the TBN and FBN recurrently. TheCBN will then use this information to insure an efficiently managednetwork as well as for load balancing to achieve optimum buffering.

The TBN performs a variety of functions, which are detailed below. Asshown in FIG. 3, one of the TBN's functions is receiving a message fromthe CBN indicating to the TBN that the MN is about to perform a handoff.In some instances, this message can be interpreted to be a “startbuffer” trigger. Along with the previous information, the CBN alsoincludes information about the MN's present address, which was extractedfrom the EAPOL-Start message received from the access point). Next, theTBN begins intercepting and starts saving all types of traffic packetsbound for the MN. Additionally, the TBN does not explicitly negotiatebuffering parameters or capabilities with the MN—as such, the TBNperforms transparently and efficiently.

The TBN allocates appropriate Buffer Lease Time (BLT), which is the timethe TBN can offer buffering service. BLT is determined by the TBN basedon several factors: user application type (real time or non real time);currently available resources/near future demand resources (determinedby demand prediction based on statistical modeling); and data rateprovided by the network.

The TBN extends the BLT itself, if necessary. A BLT extension will becalculated by the TBN based on the above factors (user application type,currently available resources/near future demand resources, and datarate). The number of allowable extensions and allocated time for eachextension may be governed by a policy, for example, instituted by aservice provider. An example is shown in FIG. 3(a), where the extensionpolicy is defined as BLT=2/3BLT (x−y), where x is policy dependent andx=maximum allowable extensions and y=counter for number of extensionsgranted.

The TBN also runs algorithms to use the memory capability efficiently byusing several available compression algorithms, or protocols. Forexample, the TBN creates a directory with a name corresponding to theMN's present address, saving its packets while stripping off the uniforminformation (e.g., source and destination address) from each packet, andreattaches the updated address header at the time of release. By runningalgorithms/protocols as detailed above, the TBN reserves a sufficientamount of memory for each application.

The TBN can receive a second message from the CBN that indicates that ahandoff has occurred. The second message can also be interpreted as a“release buffer” trigger event. As a part of the second message to theTBN, the CBN will also include the MN's new CoA as well as the servingFBN address. The CBN obtained the MN's new CoA from the binding updatesent by the previous network router, and the FBN's address from its owndatabase mapped with the MN's new CoA. This FBN, responsible forflushing packets, is located in the network where the MN recentlyentered. When this message is received, the TBN will append the MN's newCoA with each packet and direct them to the FBN, which may occur in aFIFO (First In, First Out) manner.

The TBN can drain the buffer packets in the event the service is notdelivered successfully to the MN. By clearing its memory of the unneededbuffer packets as soon as the TBN determines that a delivery is notpossible, the TBN maximizes available memory for other packet deliveriesto other MNs.

The TBN also stores the received packets according to the application.For example, if a time-sensitive application is involved, the TBN willprioritize accordingly, moving the application ahead of otherapplications that are not as time-sensitive. For example, threecategories may be used, named “high priority packets”, “medium prioritypackets”, and “low priority packets”. These packets would be handled bythe TBN according to a predetermined policy or protocol. In the case ofhigh priority packets, these would be the most time sensitive packetsand would be delivered with the highest priority. Medium prioritypackets may be those with a number of allowable extensions and anallocated time for each extension is restricted (e.g., a one-time BLTrestriction). Low priority packets are those that may tolerate deliverydelays. In the event that buffer capacity is exhausted, these packetsmay be located or relocated first to another CBN. This combination orany other combination of these can be used to handle packet deliveriesof different categories.

The TBN also directly assists the CBN in performing its managementfunctions, such as providing the CBN with information about availablecapacity, used capacity, and predicted demand, as well as a servicedelivery report. The CBN will use this information provided by the TBNfor load balancing and efficient buffering information.

Further, the TBN also informs the assisting CBN with informationrelative to its management functions, such as proving the CBN withinformation pertaining to available capacity, used capacity, andpredicted demand. The CBN will use this information provided by the TBNfor load balancing and efficient buffering information.

According to an embodiment of the present invention, the Flushing BufferNode performs the following functions, which are also illustrated inFIG. 4. The FBN receives packets from the TBN, and acts as a tunneldestination point. Further, it decapsulates the packets it receives andimmediately dispatches them to the access point (AP) for transmission tothe MN. The FBN also receives packets from peer buffering nodes fordelivery only and are intended for receiving packets from externalentities, such as a correspondent node, application server, etc.However, the FBN can be configured to reflect a desired policy orfulfill a need within the network if necessary.

In another embodiment of the present invention, the CBN, upon receivingthe destination address of the AP, (for which the MN requestedpre-authentication and intends to move to), can issue a release buffertrigger message to the TBN to commence tunneling packets to the specificFBN. Thus, the TBN will reserve a provisional CoA, and the FBN willreplace the provisional CoA with the original CoA communicated later bythe TBN to the FBN. This process will greatly reduce the packet deliverytime (also called “jitter”) but also enable the FBN to utilize itsstorage capacity more efficiently. To further enhance security, IPaddresses assigned to the CBN, TBN and FBN can either be statically ordynamically assigned. These addresses can be private and not visibleexternally.

According to another embodiment of the present invention, an ARIMAprocess is used as a method for predicting buffer resource demand. AnARIMA process is a type of Weiner process wherein the future value of astochastic variable depends only on its present value. The ARIMA processincludes an autocorrelation component, wherein the future value of astochastic variable is based on its correlation to past values, and amoving average component that filters error measurements in pastvariable observations. By applying an ARIMA process, the TBN locallypredicts the amount of buffering resources R(t) it requires as a reservefor buffering the packets for mobile nodes (MN).

The ARIMA process has several advantages which are beneficial for thepresent invention. One such advantage is in predicting the MN'sbuffering resource demand R(t) that allows CBNs to perform localprediction, without requiring communication with other CBNs. ARIMAprocesses rely on the principal that the future value of R(t) dependsonly on present and past values of R(t) irrespective of other variables.This improves efficiency and reliability and reduces cost and complexityby reducing unnecessary communications and accurately predicting bufferresource demand.

Another advantage of the ARIMA process is in predicting bufferingresource demand R(t) that allows CBNs to determine the instantaneousbuffering resource demand, rather than the average network resourcedemand, thereby providing a more precise and accurate prediction offuture buffering resource demand.

Yet another advantage of the ARIMA process is that the prediction modeluses two basic steps common to all stochastic prediction methods. Thefirst step involves performing an identification and estimation phasewherein the necessary autoregressive and moving average variables “p”and “q”, respectively, are identified and the actual autoregressive andmoving average parameters for the ARIMA (p, 1, q) are estimated. Thesecond step involves performing the forecasting phase, wherein the ARIMA(p, 1, q) model constructed in the identification and estimation phaseis used to predict future buffering resource demand R(t) based on pastobservations of buffering resource demand.

As a result, the ARIMA (p, 1, q) model predicts the buffering resourcedemand and then the using the model to predict future demand, each CBNaccurately, precisely, and efficiently predicts and reserves asufficient amount of buffering resources.

As an example of the need for an accurate prediction process, to avoidpacket loss during handoff of duration “t”, it is necessary for the TBNto be able to buffer up to the value of “rt”, where “r” is thetransmission rate of the medium, and “t” represents the duration of thehandoff. Therefore, for a transmission rate of 11 Mbps, and a handoffrequiring 4 seconds, 44 Mb of buffer is required. As the transmissionrate and handoff duration increases, the required buffer size alsoincreases. Even in cases of a “fast handoff”, substantial buffering isrequired, which necessitates an accurate prediction process.

MN before Association to New AP

Referring now to FIG. 1, in Step 1, a mobile node (MN) is shown findinga new access point (AP) by receiving a beacon. A typical beacon framecarries the following information: supported rates of data flow (e.g.,11 Mbps for 802.11b, etc.); a service set identifier (SSID—belonging toa specific wireless LAN); capability information (requirements ofstations that wish to belong to the LAN); beacon interval (time betweentransmissions); a timestamp (enabling synchronization among stationsassociated with an AP); parameter sets (e.g., information about specificsignaling methods, etc.); and/or a traffic indication map (TIM).

In Step 2, shown in FIG. 1, a mobile node (MN), according to the 802.1xstandard, sends an EAPOL-Start (Extensible Authentication Protocol)message to the AP with which it is currently associated. This message isinitiated by a MN that intends to move from jurisdiction of one AP tothe jurisdiction of another AP and desires pre-authentication with theprospective AP. The EAPOL-Start message specifies its own address aswell as the MAC (Media Access Control) address of the prospective APcontained in the beacon frame as the destination MAC address. In thepresent example, the MN initiates the EAPOL-Start message through itspresent AP (AP1 of Subnet-A in this example) to pre-authenticate itselfwith the prospective AP (AP1 of Subnet-B in this example) beforeactually associating with the prospective AP. The current AP forwards anEAPOL-Start frame to the new AP through, e.g., a backend wired LAN.

Further, a copy of the EAPOL-Start message is also forwarded to the CBNby MLME (MAC Layer Management Entity) in the AP. This message notifiesthe CBN that the MN is mobile and intends to continue the session, whichalso tells the CBN to initiate buffering service. The CBN then extractsthe source AP information (AP1 of Subnet-A in this example), destinationAP (AP1 of Subnet-B in this example), and the MN's addresses from theEAPOL-Start message, saves them in its database, and instructs the TBN(via the “start buffer” trigger) to intercept the packets destined forthe specified MN and start saving them in memory. The TBN will continuesaving packets until it receives the second instruction (via a “releasebuffer” trigger) from the CBN for flushing packets.

The sending of the EAPOL-Start message to the CBN should not beinterpreted as a security risk, as it is the initial message sent to theAP to discover the MAC address of the authenticator. According anembodiment of the present invention, the AP authorizes the CBN forservice provisionally after confirming the MN's credentials. The MN'scredentials can be upgraded or modified according to the user's desirefor a different quality of service.

In Step 3 of FIG. 1, the movement of the MN from Subnet-A to Subnet-B isshown. More specifically, the movement of the MN from the radio coverageof APi of Subnet-A to APi of Subnet-B.

In Step 4 of FIG. 1, the association of the MN with the AP is shown,using cipher keys as detailed in Step 2 above. In the example shown inFIG. 1, 802.11i cipher keys are also established between the new AP andthe MN resulting from pre-authentication, unless 802.11f or IAPP(Inter-Access Point Protocol) is used between the new AP and the old AP.AP2 must contact the authentication or AAA server to authenticate themobile station identically as was done during the initial authenticationthrough the previous AP. As IEEE 802.1x is designed to operate within aLAN, the applicability of IEEE 802.1x pre-authentication is limited tointra-subnet handoff; however, if the mobile station is configured to bemobile, e.g., among multiple WLANs, the extended concepts ofpre-authentication can be used.

MN after Association to New AP

Once the MN is associated with the new AP, a notification is sent to theprevious router AP (which had sent packets to the MN over the previouschannel) informing it of the MN's new mobility binding. This mobilitybinding or “binding update” is allows for the MN to embark on RouteOptimization as defined in the IETF MobileIPv6 standard. The mainobjectives of Route Optimization are: (1) to allow datagrams transmittedto the MN's previous router to be forwarded to its new CoA; (2) to allowany datagrams tunneled to the MN's previous router, from correspondingnodes with out-of-date binding cache entries for the MN, which areforwarded to the new CoA; and (3) to allow any resources consumed by theMN when linked to the previous router (such as radio channelreservations, buffer reservation, etc.), to be released immediately,instead of waiting for its registration lifetime to expire in duecourse. The binding update then immediately associates the MN's previousCoA with the MN's new CoA, and is authenticated using the IPv6authentication header while maintaining the previous security level.

Further, the binding update will also be communicated to the CBN, whichafter receiving it, will extract the MN's new destination address, findthe address of the FBN in its own database, and include this address inthe release buffer trigger to the TBN for the flushing of packets to theFBN. The MN's new destination address is also duly mapped in the CBN'sdatabase. The TBN will respond to the CBN's actions by forwarding allpackets to the FBN. The FBN will then decapsulate the packets sent bythe TBN dispatch them to the new AP that will transmit them to thenewly-arrived MN.

In one embodiment of the present invention, the binding update isrequired to be extended to the CBN. One way this can be accomplished isto offer buffering service to users for a subscription fee, using betterQuality of Service (QoS) as a benefit. This subscription could be free,a flat rate, or other means of measurement, depending on the serviceprovider's policies. In one example of a subscription-based service, thesubscriber's credentials can be upgraded/modified to indicate that thesubscriber desires better QoS (with minimal or no packet loss) whenmobile. If so, then the binding update package will be slightlymodified, using any of the reserved bits that are used to notify the CBNof the extension. Also, if the MN and BN are in the same IP subnet, theTBN can send the buffered packets locally to the MN using AddressResolution Protocol (ARP).

The present invention offers many advantages over the known wirelessnetworks, including the following. Transparent buffering service: the MNis not required to solicit for service and waste time and energy inservice parameters negotiating. A low signaling burden on the network:as the service is established without setting up a pre-service dialogue,thereby reducing the volume of signaling traffic on the network. Mobilenode battery life extension: since the mobile node does not have todiscover, solicit, negotiate, or conduct initial computation, the MN'sbattery life is extended that would otherwise be shortened. Immediatebuffering initialization: the network service is offered, withoutadvertising, seeks candidates, evaluates demand, determines the MN'sdemand against network limitations, and quickly offers service on thenetwork. Efficient packet loss prevention: the complete architecture ismanaged, with transit and flushing buffer nodes, using predictionmethods, to offer efficient service to the MN. Improved resource andnetwork utilization: overall architecture design provides superiornetwork resource utilization. Buffering nodes that communicate with eachother internally, improving network security.

Broad Scope of the Invention

While illustrative embodiments of the invention have been describedherein, the present invention is not limited to the various preferredembodiments described herein, but includes any and all embodimentshaving equivalent elements, modifications, omissions, combinations(e.g., of aspects across various embodiments), adaptations and/oralterations as would be appreciated by those in the art based on thepresent disclosure. The limitations in the claims are to be interpretedbroadly based on the language employed in the claims and not limited toexamples described in the present specification or during theprosecution of the application, which examples are to be construed asnon-exclusive. For example, in the present disclosure, the term“preferably”is non-exclusive and means “preferably, but not limited to”.In this disclosure and during the prosecution of this application,means-plus-function or step-plus-function limitations will only beemployed where for a specific claim limitation all of the followingconditions are present in that limitation: a) “means for” or “step for”is expressly recited; b) a corresponding function is expressly recited;and c) structure, material or acts that support that structure are notrecited. In this disclosure and during the prosecution of thisapplication, the terminology “present invention” or “invention” may beused as a reference to one or more aspect within the present disclosure.The language present invention or invention should not be improperlyinterpreted as an identification of criticality, should not beimproperly interpreted as applying across all aspects or embodiments(i.e., it should be understood that the present invention has a numberof aspects and embodiments), and should not be improperly interpreted aslimiting the scope of the application or claims. In this disclosure andduring the prosecution of this application, the terminology “embodiment”can be used to describe any aspect, feature, process or step, anycombination thereof, and/or any portion thereof, etc. In some examples,various embodiments may include overlapping features. In thisdisclosure, the following abbreviated terminology may be employed:“e.g.” which means “for example.”

1. A wireless communications network with a managed buffer nodesarchitecture, comprising: at least one controlling buffer node; at leastone transition buffer node; and at least one flushing buffer nodeproviding a comprehensive buffering service to prevent data packetlosses.
 2. The network of claim 1, wherein said controlling buffer nodeperforms managerial functions, said transition buffer node retains datapackets in transit, and said flushing buffer node facilitates thedelivery of said data packets.
 3. The network of claim 1, wherein saidcontrolling buffer node, said transition buffer node and said flushingbuffer node communicate wirelessly with each other increasing saidnetwork security.
 4. The network of claim 1, further comprising at leastone access point which has the ability to communicate with other accesspoints.
 5. The network of claim 1, wherein said controlling buffer nodefurther comprises a controlling authority performing multiple functions.6. The network of claim 1, wherein said flushing buffer node is capableof performing multiple functions comprising receiving packets from thetransition buffer node, acting as a tunnel destination point,decapsulating said data packets it receives and immediately dispatchessaid data packets to said access point (AP) for transmission to saidmobile node, and receiving said data packets from said buffer nodes. 7.The network of claim 1, wherein said controlling buffer node issues arelease buffer command after receiving the destination address of saidaccess point.
 8. The network of claim 1, wherein said controlling buffernode, transition buffer node and flushing buffer node are assignedinternet protocol addresses either statically or dynamically, and saidaddresses are also private and not visible outside said network.
 9. Thenetwork of claim 1, wherein an autoregressive integrated moving averagemodel predicts a buffering resource demand, which said network uses topredict future said buffering resource demand.
 10. The network of claim1, wherein said nodes wirelessly communicate with each other within saidnetwork preventing nodes outside of said network from communicating withsaid nodes.
 11. A wireless communications network, comprising: acontrolling buffer node which performs managerial functions; atransition buffer node which holds data packets in transit; a flushingbuffer node which facilitates the delivery of data packets; wherein saidnetwork provides a comprehensive buffering service to prevent said datapacket losses during handoffs and wherein said nodes communicate witheach other wirelessly and internally.
 12. The network of claim 11,further comprising at least one access point, which is capable ofcommunicating with at least one other access point.
 13. The network ofclaim 11, wherein said controlling buffer node is a controllingauthority.
 14. The network of claim 11, wherein said controlling buffernode issues a release buffer command after receiving the destinationaddress of the access point.
 15. The network of claim 11, wherein saidcontrolling buffer node, transition buffer node and flushing buffer nodeare assigned internet protocol addresses either statically ordynamically, said address are also private and not visible outside saidnetwork.
 16. The network of claim 11, wherein an autoregressiveintegrated moving average model predicts the buffering resource demand,which said network uses to predict future said buffering resourcedemand.
 17. A method for providing a wireless communications networkwith a managed buffer nodes architecture, comprising: a mobile nodedetecting an access point, exchanging data between said mobile node andsaid access point, having said mobile node move closer to a secondaccess point, authenticating said mobile node with said second accesspoint, and a performing a binding update between said mobile node andsaid second access point.
 18. The method according to claim 17, furthercomprising said access point exchanging data with at least one flushingbuffer node, at least one transit buffer node, and at least onecontroller buffer node, supporting the movement of said mobile node. 19.The method according to claim 17, further comprising said controllingbuffer node receiving a start message, directing said transit buffernode to start buffering, receiving a binding update, and directing saidtransit buffer node to flush data to said flushing buffer node.
 20. Themethod according to claim 17, further comprising said transit buffernode receiving a trigger from said controlling buffer node, creating adirectory for said MN, setting a timer for buffer lease time,intercepting and retaining data for said MN, receiving the address ofsaid flushing buffer node, forwarding the data for the MN to the servingflushing buffer node, emptying said transit buffer node's memory, andreporting to said controlling buffer node.
 21. The method according toclaim 17, wherein said flushing buffer node is capable of performingmultiple functions, comprising receiving data from the transit buffernode, acting as a tunnel destination point, decapsulating said data itreceives and dispatching them to the access point for transmission tothe mobile node, and receiving data from other nodes.